منابع مشابه
Coloring 3-Colorable Graphs
Graph coloring in general is an extremely easy-to-understand yet powerful tool. It has wide-ranging applications from register allocation to image segmentation. For such a simple problem, however, the question is surprisingly intractable. In this section I will introduce the problem formally, as well as present some general background on graph coloring. There are several ways to color a graph, ...
متن کاملTiling Tripartite Graphs with 3-Colorable Graphs
For any positive real number γ and any positive integer h, there is N0 such that the following holds. Let N > N0 be such that N is divisible by h. If G is a tripartite graph with N vertices in each vertex class such that every vertex is adjacent to at least (2/3 + γ)N vertices in each of the other classes, then G can be tiled perfectly by copies of Kh,h,h. This extends the work in [Discrete Mat...
متن کاملOn Uniquely List Colorable Graphs
Let G be a graph with n vertices and suppose that for each vertex v in G, there exists a list of k colors, L(v), such that there is a unique proper coloring for G from this collection of lists, then G is called a uniquely k–list colorable graph. Recently M. Mahdian and E.S. Mahmoodian characterized uniquely 2–list colorable graphs. Here we state some results which will pave the way in character...
متن کاملUniquely 2-list colorable graphs
A graph is called to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on the number of colors used. In this way we generalize a theorem which characterizes uniquely 2–list colorable graphs. We introduce the uniquely list chromatic number of a graph and make a conjecture about it which is a...
متن کاملBipartite, -Colorable and -Colored Graphs
A labeled graph is bipartite if its vertex set can be partitioned into two disjoint subsets and , = ∪, such that every edge of is of the form ( ), where ∈ and ∈ . Let be a positive integer and = {1 2 }. A labeled graph is colorable if there exists a function → with the property that adjacent vertices must be colored differently. Clearly is bipartit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2011
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.07.001